Petersen-Twisted-Torus Networks for Multiprocessor Systems
نویسندگان
چکیده
Petersen-Gaussian (PG) networks are a broad family of interconnection networks for multi processor systems proposed recently. In this paper, a special case of PG networks, called PetersenTwisted-Torus (PTT) network, is considered. We analyze the diameter of PTT network, and find that PTT has smaller diameter and lower costing requirement than the well-known honeycomb mesh, diagonal mesh, torus, hexagonal torus, honeycomb torus and Petersen torus networks.
منابع مشابه
Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملQoS Routing in General Petersen-Torus Networks: A Case Study
Petersen-Torus as an interconnection network was extensively studied. This letter proposed two elementary algorithms for QoS routing in general Petersen-Torus networks, which can be modeled as graph ( , ) PT m n with K QoS parameters associated with each edge. Theoretic analysis for the proposed algorithms was conducted. And the time complexity of these two algorithms was summarized and compare...
متن کاملCharacter varieties of once-punctured torus bundles with tunnel number one
We determine the PSL2(C) and SL2(C) character varieties of the once-punctured torus bundles with tunnel number one, i.e. the once-punctured torus bundles that arise from filling one boundary component of the Whitehead link exterior. In particular, we determine ‘natural’ models for these algebraic sets, identify them up to birational equivalence with smooth models, and compute the genera of the ...
متن کاملOne-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new i...
متن کاملFault-tolerant graphs for hypercubes and tori
Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer t and graph H, construct a graph G from H by adding a minimum number A(t, H) of edges such that even after deleting any t edges from G the remaining graph contains H as a subgraph. We estimate A(t, H) for the hypercube and torus, which are well-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCIT
دوره 5 شماره
صفحات -
تاریخ انتشار 2010